DRAFT: Deterministic Periodic Countable Automata
نویسنده
چکیده
We define a new automaton, the Deterministic Periodic Countable Automaton (DPCA). We prove properties of the languages expressable by DPCAs (which we call Countably Regular languages). In particular, we give examples of languages that are (and are not) countably regular, explore closure properties of countably regular languages, and develop a variant of regular expressions that express the countably regular languages.
منابع مشابه
DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملTwo-Way Automata in Coq
We formally verify translations from two-way automata to one-way automata based on results from the literature. Following Vardi, we obtain a simple reduction from nondeterministic two-way automata to one-way automata that leads to a doubly-exponential increase in the number of states. By adapting the work of Shepherdson and Vardi, we obtain a singlyexponential translation from nondeterministic ...
متن کاملReduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملPeriodicity and Transitivity for Cellular Automata in Besicovitch Topologies
We study cellular automata (CA) behavior in Besicovitch topology. We solve an open problem about the existence of transitive CA. The proof of this result has some interest in its own since it is obtained by using Kolmogorov complexity. At our knowledge it if the first result on discrete dynamical systems obtained using Kolmogorov complexity. We also prove that every CA (in Besicovitch topology)...
متن کاملCellular Automata and Models of Computation
Preface This issue contains seven papers presented during the " Third Symposium on Cellular Automata– Journées Automates Cellulaires " (JAC 2012), held in La Marana, Corsica (France) in the period Septem-ber 19th–21th, 2012. The scope of the symposium is centered on Cellular Automata (CA), tilings and related models of computation. Topics of interest include (but are not limited to) algorithmic...
متن کامل